The zeroth-order general Randic index, 0R?(G), of a connected graph G, is defined as 0 P R?(G) = ni =1 d?i , where di the degree vertex vi G and ? arbitrary real number. We consider linear combinations 0R?(G) form (? + ?)0R??1(G) ?? 0R??2(G) 2a 0R??1(G) a2 0R??2(G), an number, determine their bounds. As corollaries, various upper lower bounds indices that represent some special cases are obtain...

In this paper, we compute ABC index, Randic connectivity index, Sum connectivity index, GA index, Harmonic index, General Randic index of Triglyceride. AMS subject classification:

let $d$ be a digraph with vertex set $v(d)$. for vertex $vin v(d)$, the degree of $v$,denoted by $d(v)$, is defined as the minimum value if its out-degree and its in-degree.now let $d$ be a digraph with minimum degree $deltage 1$ and edge-connectivity$lambda$. if $alpha$ is real number, then the zeroth-order general randic index is definedby $sum_{xin v(d)}(d(x))^{alpha}$. a digraph is maximall...

Recently, the subdivision Randic index was introduced. In this paper, we present new version of Randic index by using some graph operator and in related to the subdivision Randic index. Next, by using some results about this version, it is computed for TUC C (R) nanotubes. 4 8

Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree  and its in-degree . Now let D be a digraph with minimum degree  and edge-connectivity If  is real number, then the zeroth-order general Randic index is defined by   .  A digraph is maximally edge-connected if . In this paper we present sufficient condi...

The general Randić index Rα(G) is the sum of the weights (dG(u)dG(v)) over all edges uv of a (molecular) graph G, where α is a real number and dG(u) is the degree of the vertex u of G. In this paper, for any real number α ≤ −1, the minimum general Randić index Rα(T ) among all the conjugated trees (trees with a Kekulé structure) is determined and the corresponding extremal conjugated trees are ...

Let G = (V, E), V {v1, v2,..., vn}, be a simple connected graph of order n and size m, without isolated vertices. Denote by d1 ? d2 ?... dn, di d(vi) sequence vertex degrees G. The general zeroth-order Randic index is defined as 0R?(G) ?ni =1 d?i, where an arbitrary real number. corresponding coindex via 0R??(G) ?ni=1(n?1?di)d?i. Some new bounds for the relationship between 0R??(G?) 0R???1(G?) ...

let $g$ be a simple graph with vertex set $v(g) = {v_1, v_2,ldots, v_n}$ and $d_i$ the degree of its vertex $v_i$, $i = 1, 2,cdots, n$. inspired by the randi'c matrix and the general randi'cindex of a graph, we introduce the concept of general randi'cmatrix $textbf{r}_alpha$ of $g$, which is defined by$(textbf{r}_alpha)_{i,j}=(d_id_j)^alpha$ if $v_i$ and $v_j$ areadjacent, and zero otherwise. s...

Let G(n; m) be a connected graph without loops and multiple edges which has n vertices and m edges. We ÿnd the graphs on which the zeroth-order connectivity index, equal to the sum of degrees of vertices of G(n; m) raised to the power − 1 2 , attains maximum.